Improving the Quantification of Highly Overlapping Chromatographic Peaks by Using Product Unit Neural Networks Modeled by an Evolutionary Algorithm

نویسندگان

  • César Hervás-Martínez
  • Alfonso Carlos Martínez-Estudillo
  • Manuel Silva
  • Juan Manuel Serrano
چکیده

This work investigates the ability of multiplicative (on the basis of product units) and sigmoidal neural models built by an evolutionary algorithm to quantify highly overlapping chromatographic peaks. To test this approach, two N-methylcarbamate pesticides, carbofuran and propoxur, were quantified using a classic peroxyoxalate chemiluminescence reaction as a detection system for chromatographic analysis. The four-parameter Weibull curve associated with the profile of the chromatographic peak estimated by the Levenberg-Marquardt method was used as input data for both models. Straightforward network topologies (one output) allowed the analytes to be quantified with great accuracy and precision. Product unit neural networks provided better information ability, smaller network architectures, and more robust models (smaller standard deviation). The reduced dimensions of the selected models enabled the derivation of simple quantification equations to transform the input variables into the output variable. These equations can be more easily interpreted from a chemical point of view than those provided by sigmoidal neural networks, and the effect of both analytes on the characteristics of chromatographic bands, namely profile, dispersion, peak height, and residence time, can be readily established.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel Radial Basis Function Neural Networks based on Probabilistic Evolutionary and Gaussian Mixture Model for Satellites Optimum Selection

In this study, two novel learning algorithms have been applied on Radial Basis Function Neural Network (RBFNN) to approximate the functions with high non-linear order. The Probabilistic Evolutionary (PE) and Gaussian Mixture Model (GMM) techniques are proposed to significantly minimize the error functions. The main idea is concerning the various strategies to optimize the procedure of Gradient ...

متن کامل

Detecting Overlapping Communities in Social Networks using Deep Learning

In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...

متن کامل

Comparing diagnosis of depression in depressed patients by EEG, based on two algorithms :Artificial Nerve Networks and Neuro-Fuzy Networks

Background and aims: Depression disorder is one of the most common diseases, but the diagnosis is widely complicated and controversial because of interventions, overlapping and confusing nature of the disease. So, keeping previous patients’ profile seems effective for diagnosis and treatment of present patients. Use of this memory is latent in synthetic neuro-fuzzy algorithm. P...

متن کامل

Applying evolutionary optimization on the airfoil design

In this paper, lift and drag coefficients were numerically investigated using NUMECA software in a set of 4-digit NACA airfoils. Two metamodels based on the evolved group method of data handling (GMDH) type neural networks were then obtained for modeling both lift coefficient (CL) and drag coefficient (CD) with respect to the geometrical design parameters. After using such obtained polynomial n...

متن کامل

Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain

Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of chemical information and modeling

دوره 45 4  شماره 

صفحات  -

تاریخ انتشار 2005